Evolutionary Algorithms Combined with Deterministic Search

This paper provides insight into combining stochastic and deterministic search methods using evolutionary algorithms (EAs) such as evolutionary programming, evolutionary strategies, and genetic algorithms integrated with depth-rst search with backtracking, branch and bound, and best-rst search algorithms such as A. An important view of such an integration focuses on both theoretical analysis and experimental evaluation. Included in the discussion is the constraining impact of the \No Free Lunch Theorem" on combined search performance. Also, a variety of combinations of EAs and deterministic combined search methods are proposed along with expert system components. Discussion of anticipated results of such architectures speculates about existence of high performance integrated search environments. A particular successful speciic NPC problem environment is presented that employs search metrics for short-term performance evaluation and combined search algorithm selection.